METHOD OF FAST MATRIX MULTIPLICATION UNDER ARM ARCHITECTURE USING SIMD INSTRUCTIONS

Fast Sorted-Set Intersection using SIMD Instructions

In this paper, we focus on sorted-set intersection which is an important part in many algorithms, e.g., RID-list intersection, inverted indexes, and others. In contrast to traditional scalar sorted-set intersection algorithms that try to reduce the number of comparisons, we propose a parallel algorithm that relies on speculative execution of comparisons. In general, our algorithm requires more ...

Using SIMD instructions for fast likelihood calculation in LVCSR

Screaming fast Galois field arithmetic using intel SIMD instructions

Galois Field arithmetic forms the basis of Reed-Solomon and other erasure coding techniques to protect storage systems from failures. Most implementations of Galois Field arithmetic rely on multiplication tables or discrete logarithms to perform this operation. However, the advent of 128-bit instructions, such as Intel’s Streaming SIMD Extensions, allows us to perform Galois Field arithmetic mu...

SIMD Types Example: Matrix Multiplication [N4454]

This document describes one possible implementation of a matrix class and matrix multiplication using the data-parallel SIMD types introduced in [N4184]. The example shows the basic use of SIMD types for manual transformation of a loop over scalars to a loop with increased stride using SIMD vector loads and stores and SIMD operations in the loop body.

Fast matrix multiplication using coherent configurations

We introduce a relaxation of the notion of tensor rank, called s-rank, and show that upper bounds on the s-rank of the matrix multiplication tensor imply upper bounds on the ordinary rank. In particular, if the “s-rank exponent of matrix multiplication” equals 2, then ω = 2. This connection between the s-rank exponent and the ordinary exponent enables us to significantly generalize the group-th...